Lsign Reordered Lsign Reordered

نویسنده

  • Pascal Van Hentenryck
چکیده

LSign 18] is an elegant domain for analyzing constraint logic programming languages over linear real constraints. Its key conceptual ideas are the abstraction of linear constraints by replacing coeecients by their signs and the use of annotations for preserving multiplicity information on the constraints. Unfortunately, the ordering of abstract constraint stores given in 18] does not capture the intended meaning and makes it impossible to prove the consistency of the abstract operations of LSign. In this paper, we reconsider the domain LSign. Our rst contribution is to deene a new ordering on abstract constraint stores and to give the meaning of the domain through a monotone concretization function from abstract stores to sets of constraint stores, where a constraint store is a multiset of constraints. Our second contribution is to show that ordering two abstract stores reduces to a matching problem, which can be solved in polynomial time. Our last contribution is to propose a simpler and more precise algorithm for abstract projection and a schema for generating upper bound operations and to prove their consistency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reordered Search and Tuple Unfolding for Ngram-based SMT

In Statistical Machine Translation, the use of reordering for certain language pairs can produce a significant improvement on translation accuracy. However, the search problem is shown to be NP-hard when arbitrary reorderings are allowed. This paper addresses the question of reordering for an Ngram-based SMT approach following two complementary strategies, namely reordered search and tuple unfo...

متن کامل

Reordering of IP Packets in Internet

We have analyzed the measurements of the end-to-end packet reordering by tracing UDP packets between 12 testboxes of RIPE NCC. We showed that reordering quite often happens in Internet. For bursts of 50 100-byte UDP packets, there were about 56% of all the streams arrived at the destinations out-of-order. We studied the extent of the reordering in these streams, and observed that most reordered...

متن کامل

Erratum for Clause Restructuring for SMT Not Absolutely Helpful

In Howlett and Dras (2011), we systematically varied several settings of a reordering-aspreprocessing phrase-based SMT system to explore under what conditions it might underperform relative to the baseline PSMT system. This was motivated by our earlier work (Howlett and Dras, 2010) where we had seen precisely this outcome. We have identified an error in the configuration files for the Howlett a...

متن کامل

Sorting Reordered Packets with Interrupt Coalescing

TCP performs poorly in networks with serious packet reordering. Processing reordered packets in the TCP-layer is costly and inefficient, involving interaction of the sender and receiver. Motivated by the interrupt coalescing mechanism that delivers packets upward for protocol processing in blocks, we propose a new strategy, Sorting Reordered Packets with Interrupt Coalescing (SRPIC), to reduce ...

متن کامل

Reduction of Power Dissipation in Dynamic BiCMOS Logic Gates by Transistor Reordering

This paper explores the deterministic transistor reordering in low-voltage dynamic BiCMOS logic gates, for reducing the dynamic power dissipation. The constraints of load driving (discharging) capability and NPN turn-on delay for MOSFET reordered structures has been carefully considered. Simulations shows significant reduction in the dynamic power dissipation for the transistor reordered BiCMOS...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995